A PSPACE-complete Fragment of Second-order Linear Logic
نویسنده
چکیده
Existentially quantified variables are the source of non-decidability for second-order linear logic without exponentials (MALL2). We present a decision procedure for a fragment of MALL2 based on a canonical instantiation of these variables and using inference permutability in proofs. We also establish that this fragment is PSPACE-complete. @ 1999 Elsevier Science B.V. Ail rights reserved.
منابع مشابه
Reasoning in the Bernays-Schönfinkel-Ramsey Fragment of Separation Logic
Separation Logic (SL) is a well-known assertion language used in Hoare-style modular proof systems for programs with dynamically allocated data structures. In this paper we investigate the fragment of first-order SL restricted to the Bernays-Schönfinkel-Ramsey quantifier prefix ∃∗∀∗, where the quantified variables range over the set of memory locations. When this set is uninterpreted (has no as...
متن کاملReasoning in the Bernays-Schoenfinkel-Ramsey Fragment of Separation Logic
Separation Logic (SL) is a well-known assertion language used in Hoare-style modular proof systems for programs with dynamically allocated data structures. In this paper we investigate the fragment of first-order SL restricted to the Bernays-Schönfinkel-Ramsey quantifier prefix ∃∗∀∗, where the quantified variables range over the set of memory locations. When this set is uninterpreted (has no as...
متن کاملThe Finite Model Property for Various Fragments of Linear Logic
To show that a formula A is not provable in propositional classical logic, it suuces to exhibit a nite boolean model which does not satisfy A. A similar property holds in the intuitionistic case, with Kripke models instead of boolean models (see for instance TvD88]). One says that the propositional classical logic and the propositional intuitionistic logic satisfy a nite model property. In part...
متن کاملTemporal Logics over Linear Time Domains Are in PSPACE
We investigate the complexity of the satisfiability problem of temporal logics with a finite set of modalities definable in the existential fragment of monadic second-order logic. We show that the problem is in pspace over the class of all linear orders. The same techniques show that the problem is in pspace over many interesting classes of linear orders.
متن کاملOptimization Complexity of Linear Logic Proof Games
A class of linear logic proof games is developed, each with a numeric score that depends on the number of preferred axioms used in a complete or partial proof tree. The complexity of these games is analyzed for the np-complete multiplicative fragment (mll) extended with additive constants and the pspace-complete multiplicative, additive fragment (mall) of propositional linear logic. In each cas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 224 شماره
صفحات -
تاریخ انتشار 1999